# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def coinChange(self, coins: List[int], amount: int) -> int:
        if amount == 0:
            return 0

        coin_count = len(coins)

        if coin_count == 0:
            return -1

        min_coin = min(coins)
        if min_coin > amount:
            return -1

        INT_MAX = 2 ** 31

        dp = [[INT_MAX] * (amount + 1) for _ in range(coin_count + 1)]

        for i in range(coin_count + 1):
            dp[i][0] = 0

        for i in range(1, coin_count + 1):
            for j in range(1, amount + 1):
                if j >= coins[i - 1]:
                    if dp[i][j - coins[i - 1]] != INT_MAX:
                        dp[i][j] = min(dp[i - 1][j], dp[i][j - coins[i - 1]] + 1)
                    else:
                        dp[i][j] = dp[i - 1][j]
                else:
                    dp[i][j] = dp[i - 1][j]

        if dp[coin_count][amount] == INT_MAX:
            return -1

        return dp[coin_count][amount]


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1,2,5], 11, 3),
        ([2], 3, -1),
        ([1], 0, 0),
        ([1], 1, 1),
        ([1], 2, 2)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.coinChange(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

